Video codec with shared interpolation filter and method for use therewith

ABSTRACT

A video processing device operates in an encoding mode when a mode selection signal has a first value and operates in a decoding mode when the mode selection signal has a second value. The video processing device utilizes an interpolation filter to perform an encoding function in the encoding mode and to perform a decoding function in a decoding mode.

CROSS REFERENCE TO RELATED PATENTS

The present application is related the following applications:

application Ser. No. 11/716,773, entitled, VIDEO PROCESSING SYSTEM ANDDEVICE WITH ENCODING AND DECODING MODES AND METHOD FOR USE THEREWITH,filed on Mar. 12, 2007; and

application Ser. No. ______, entitled, VIDEO CODEC WITH SHAREDINTRA-PREDICTION MODULE AND METHOD FOR USE THEREWITH, filed on ______.

TECHNICAL FIELD OF THE INVENTION

The present invention relates to encoding used in devices such as videoencoders/decoders.

DESCRIPTION OF RELATED ART

Video encoding has become an important issue for modern video processingdevices. Robust encoding algorithms allow video signals to betransmitted with reduced bandwidth and stored in less memory. However,the accuracy of these encoding methods face the scrutiny of users thatare becoming accustomed to greater resolution and higher picturequality. Standards have been promulgated for many encoding methodsincluding the H.264 standard that is also referred to as MPEG-4, part 10or Advanced Video Coding, (AVC). While this standard sets forth manypowerful techniques, further improvements are possible to improve theperformance and speed of implementation of such methods. The videosignal encoded by these encoding methods must be similarly decoded forplayback on most video display devices.

The efficient encoding and decoding of video signals and the efficientimplementation of encoder and decoders is important to theimplementation of many video devices, particularly video devices thatare destined for home use. Further limitations and disadvantages ofconventional and traditional approaches will become apparent to one ofordinary skill in the art through comparison of such systems with thepresent invention.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

FIGS. 1-3 present pictorial diagram representations of various videodevices in accordance with embodiments of the present invention.

FIG. 4 presents a block diagram representation of a video device inaccordance with an embodiment of the present invention.

FIG. 5 presents a block diagram representation of a videoencoder/decoder 102 in accordance with an embodiment of the presentinvention.

FIG. 6 presents a graphical representation of macroblock pixels andinterpolated pixels in accordance with an embodiment of the presentinvention.

FIG. 7 presents a block flow diagram of a video encoding operation inaccordance with an embodiment of the present invention.

FIG. 8 presents a block flow diagram of a video decoding operation inaccordance with an embodiment of the present invention.

FIG. 9 presents a graphical representation of the relationship betweenexample top frame and bottom frame macroblocks (250, 252) and exampletop field and bottom field macroblocks (254, 256) in accordance with anembodiment of the present invention.

FIG. 10 presents a graphical representation that shows examplemacroblock partitioning in accordance with an embodiment of the presentinvention.

FIG. 11 presents a block diagram representation of a videoencoder/decoder 102 that includes motion refinement engine 175 inaccordance with an embodiment of the present invention.

FIG. 12 presents a block diagram representation of a video distributionsystem 375 in accordance with an embodiment of the present invention.

FIG. 13 presents a block diagram representation of a video storagesystem 179 in accordance with an embodiment of the present invention.

FIG. 14 presents a flowchart representation of a method in accordancewith an embodiment of the present invention.

FIG. 15 presents a flowchart representation of a method in accordancewith an embodiment of the present invention.

DETAILED DESCRIPTION OF THE INVENTION INCLUDING THE PRESENTLY PREFERREDEMBODIMENTS

FIGS. 1-3 present pictorial diagram representations of various videodevices in accordance with embodiments of the present invention. Inparticular, set top box 10 with built-in digital video recorderfunctionality or a stand alone digital video recorder, computer 20 andportable computer 30 illustrate electronic devices that incorporate avideo device 125 that includes one or more features or functions of thepresent invention. While these particular devices are illustrated, videoprocessing device 125 includes any device that is capable of encoding,decoding and/or transcoding video content in accordance with the methodsand systems described in conjunction with FIGS. 4-15 and the appendedclaims.

FIG. 4 presents a block diagram representation of a video device inaccordance with an embodiment of the present invention. In particular,this video device includes a receiving module 100, such as a televisionreceiver, cable television receiver, satellite broadcast receiver,broadband modem, 3G transceiver or other information receiver ortransceiver that is capable of receiving a received signal 98 andextracting one or more video signals 110 via time divisiondemultiplexing, frequency division demultiplexing or otherdemultiplexing technique. Video processing device 125 includes videoencoder/decoder 102 and is coupled to the receiving module 100 toencode, decode or transcode the video signal for storage, editing,and/or playback in a format corresponding to video display device 104.

In accordance with the present invention, the video encoder/decoder 102operates in an encoding mode when a mode selection signal has a firstvalue and operates in a decoding mode when the mode selection signal hasa second value. The video encoder/decoder 102 includes one or moreshared modules that function in both encoding and decoding modes. Forinstance, the video processing device utilizes an interpolation filterand/or an intra-prediction module that perform an encoding function orfunctions in the encoding mode and to perform a decoding function orfunctions in a decoding mode. This re-use of modules between encodingand decoding reduces the number of components and/or the complexity ofthe design of video encoder/decoder 102. Video encoder/decoder 102includes many optional functions and features described in conjunctionwith FIGS. 5-15 that follow.

In an embodiment of the present invention, the received signal 98 is abroadcast video signal, such as a television signal, high definitiontelevision signal, enhanced definition television signal or otherbroadcast video signal that has been transmitted over a wireless medium,either directly or through one or more satellites or other relaystations or through a cable network, optical network or othertransmission network. In addition, received signal 98 can be generatedfrom a stored video file, played back from a recording medium such as amagnetic tape, magnetic disk or optical disk, and can include astreaming video signal that is transmitted over a public or privatenetwork such as a local area network, wide area network, metropolitanarea network or the Internet.

Video signal 110 can include an analog video signal that is formatted inany of a number of video formats including National Television SystemsCommittee (NTSC), Phase Alternating Line (PAL) or Sequentiel CouleurAvec Memoire (SECAM). Processed video signal 112 can include a digitalvideo signal complying with a digital video codec standard such asH.264, MPEG-4 Part 10 Advanced Video Coding (AVC) or another digitalformat such as a Motion Picture Experts Group (MPEG) format (such asMPEG1, MPEG2 or MPEG4), Quicktime format, Real Media format, WindowsMedia Video (WMV) or Audio Video Interleave (AVI), etc.

Video display devices 104 can include a television, monitor, computer,handheld device or other video display device that creates an opticalimage stream either directly or indirectly, such as by projection, basedon decoding the processed video signal 112 either as a streaming videosignal or by playback of a stored digital video file.

FIG. 5 presents a block diagram representation of a videoencoder/decoder 102 in accordance with an embodiment of the presentinvention. In particular, video encoder/decoder 102 can be a video codecthat operates in accordance with many of the functions and features ofthe H.264 standard, the MPEG-4 standard, VC-1 (SMPTE standard 421M) orother standard, to process processed video signal 112 to encode, decodeor transcode video input signal 110. Video input signal 110 isoptionally formatted by signal interface 198 for encoding, decoding ortranscoding.

The video encoder/decoder 102 includes a processing module 200 that canbe implemented using a single processing device or a plurality ofprocessing devices. Such a processing device may be a microprocessor,co-processors, a micro-controller, digital signal processor,microcomputer, central processing unit, field programmable gate array,programmable logic device, state machine, logic circuitry, analogcircuitry, digital circuitry, and/or any device that manipulates signals(analog and/or digital) based on operational instructions that arestored in a memory, such as memory module 202. Memory module 202 may bea single memory device or a plurality of memory devices. Such a memorydevice can include a hard disk drive or other disk drive, read-onlymemory, random access memory, volatile memory, non-volatile memory,static memory, dynamic memory, flash memory, cache memory, and/or anydevice that stores digital information. Note that when the processingmodule implements one or more of its functions via a state machine,analog circuitry, digital circuitry, and/or logic circuitry, the memorystoring the corresponding operational instructions may be embeddedwithin, or external to, the circuitry comprising the state machine,analog circuitry, digital circuitry, and/or logic circuitry.

Processing module 200, and memory module 202 are coupled, via bus 221,to the signal interface 198 and a plurality of other modules, such asmotion search module 204, motion refinement module 206, direct modemodule 208, intra-prediction module 210, mode decision module 212,reconstruction module 214, entropy coding/reorder module 216, neighbormanagement module 218, forward transform and quantization module 220 anddeblocking filter module 222. The modules of video encoder/decoder 102can be implemented in software or firmware and be structured asoperations performed by processing module 200. Alternatively, one ormore of these modules can be implemented using a hardware engine thatincludes a state machine, analog circuitry, digital circuitry, and/orlogic circuitry, and that operates either independently or under thecontrol and/or direction of processing module 200 or one or more of theother modules, depending on the particular implementation. It shouldalso be noted that the software implementations of the present inventioncan be stored on a tangible storage medium such as a magnetic or opticaldisk, read-only memory or random access memory and also be produced asan article of manufacture. While a particular bus architecture is shown,alternative architectures using direct connectivity between one or moremodules and/or additional busses can likewise be implemented inaccordance with the present invention.

Video encoder/decoder 102 can operate in various modes of operation thatinclude an encoding mode and a decoding mode that is set by the value ofa mode selection signal that may be a user defined parameter, userinput, register value, memory value or other signal. In addition, invideo encoder/decoder 102, the particular standard used by the encodingor decoding mode to encode or decode the input signal can be determinedby a standard selection signal that also may be a user definedparameter, user input, register value, memory value or other signal. Inan embodiment of the present invention, the operation of the encodingmode utilizes a plurality of modules that each perform a specificencoding function. The operation of decoding also utilizes at least oneof these plurality of modules to perform a similar function in decoding.In this fashion, modules such as the motion refinement module 206 andmore particularly an interpolation filter used therein, andintra-prediction module 210, can be used in both the encoding anddecoding process to save on architectural real estate when videoencoder/decoder 102 is implemented on an integrated circuit or toachieve other efficiencies. In addition, some or all of the componentsof the direct mode module 208, mode decision module 212, reconstructionmodule 214, transformation and quantization module 220, deblockingfilter module 222 or other function specific modules can be used in boththe encoding and decoding process for similar purposes.

Motion compensation module 150 includes a motion search module 204 thatprocesses pictures from the video input signal 110 based on asegmentation into macroblocks of pixel values, such as of 16 pixels by16 pixels size, from the columns and rows of a frame and/or field of thevideo input signal 110. In an embodiment of the present invention, themotion search module determines, for each macroblock or macroblock pairof a field and/or frame of the video signal one or more motion vectors(depending on the partitioning of the macroblock into subblocks asdescribed further in conjunction with FIG. 10) that represents thedisplacement of the macroblock (or subblock) from a reference frame orreference field of the video signal to a current frame or field. Inoperation, the motion search module operates within a search range tolocate a macroblock (or subblock) in the current frame or field to aninteger pixel level accuracy such as to a resolution of 1-pixel.Candidate locations are evaluated based on a cost formulation todetermine the location and corresponding motion vector that have a mostfavorable (such as lowest) cost.

In an embodiment of the present invention, a cost formulation is basedon the Sum of Absolute Difference (SAD) between the reference macroblockand candidate macroblock pixel values and a weighted rate term thatrepresents the number of bits required to be spent on coding thedifference between the candidate motion vector and either a predictedmotion vector (PMV) that is based on the neighboring macroblock to theright of the current macroblock and on motion vectors from neighboringcurrent macroblocks of a prior row of the video input signal or anestimated predicted motion vector that is determined based on motionvectors from neighboring current macroblocks of a prior row of the videoinput signal. In an embodiment of the present invention, the costcalculation avoids the use of neighboring subblocks within the currentmacroblock. In this fashion, motion search module 204 is able to operateon a macroblock to contemporaneously determine the motion search motionvector for each subblock of the macroblock.

A motion refinement module 206 generates a refined motion vector foreach macroblock of the plurality of macroblocks, based on the motionsearch motion vector. In an embodiment of the present invention, themotion refinement module determines, for each macroblock or macroblockpair of a field and/or frame of the video input signal 110, a refinedmotion vector that represents the displacement of the macroblock from areference frame or reference field of the video signal to a currentframe or field. In operation, the motion refinement module 206 includesan interpolation filter 207 that generates a plurality of interpolatedpixels from the pixels of a macroblock or subblock. Further detailsregarding the operation of interpolation filter 207 are provided inconjunction with FIG. 6 that follows.

Based on the pixels and interpolated pixels, the motion refinementmodule 206 refines the location of the macroblock in the current frameor field to a greater pixel level accuracy such as to a resolution of¼-pixel or other sub-pixel resolution. Candidate locations are alsoevaluated based on a cost formulation to determine the location andrefined motion vector that have a most favorable (such as lowest) cost.As in the case with the motion search module, a cost formulation can bebased on the a sum of the Sum of Absolute Difference (SAD) between thereference macroblock and candidate macroblock pixel values and aweighted rate term that represents the number of bits required to bespent on coding the difference between the candidate motion vector andeither a predicted motion vector (PMV) that is based on the neighboringmacroblock to the right of the current macroblock and on motion vectorsfrom neighboring current macroblocks of a prior row of the video inputsignal or an estimated predicted motion vector that is determined basedon motion vectors from neighboring current macroblocks of a prior row ofthe video input signal. In an embodiment of the present invention, thecost calculation avoids the use of neighboring subblocks within thecurrent macroblock. In this fashion, motion refinement module 206 isable to operate on a macroblock to contemporaneously determine themotion search motion vector for each subblock of the macroblock.

In addition, motion search module 202 or motion refinement module 204 isoperable to determine a skip mode cost of the P Slices of video inputsignal 110 by evaluating a cost associated with a stationary motionvector, and by skipping portions of motion search and/or motionrefinement if the skip mode cost compares favorably to a skip modethreshold.

When estimated predicted motion vectors are used, the cost formulationavoids the use of motion vectors from the current row and both themotion search module 204 and the motion refinement module 206 canoperate in parallel on an entire row of video input signal 110, tocontemporaneously determine the refined motion vector for eachmacroblock in the row.

A direct mode module 208 generates a direct mode motion vector for eachmacroblock, based on macroblocks that neighbor the macroblock. In anembodiment of the present invention, the direct mode module 208 operatesto determine the direct mode motion vector and the cost associated withthe direct mode motion vector based on the cost for candidate directmode motion vectors for the B slices of video input signal 110, such asin a fashion defined by the H.264 standard.

While the prior modules have focused on inter-prediction of the motionvector, intra-prediction module 210 generates a best intra predictionmode for each macroblock of the plurality of macroblocks. In anembodiment of the present invention, intra-prediction module 210operates as defined by the H.264 standard, however, otherintra-prediction techniques can likewise be employed. In particular,intra-prediction module 210 operates to evaluate a plurality of intraprediction modes such as a Intra-4×4 or Intra-16×16, which are lumaprediction modes, chroma prediction (8×8) or other intra coding, basedon motion vectors determined from neighboring macroblocks to determinethe best intra prediction mode and the associated cost. As will bediscussed further in conjunction with FIGS. 7 and 8, theintra-prediction module 210 can be used in both encoding and decoding.

A mode decision module 212 determines a final motion vector for eachmacroblock of the plurality of macroblocks based on costs associatedwith the refined motion vector, the direct mode motion vector, and thebest intra prediction mode, and in particular, the method that yieldsthe most favorable (lowest) cost, or an otherwise acceptable cost. Areconstruction module 214 completes the motion compensation bygenerating residual luma and/or chroma pixel values corresponding to thefinal motion vector for each macroblock of the plurality of macroblocks.

A forward transform and quantization module 220 of video encoder/decoder102 generates processed video signal 112 by transforming coding andquantizing the residual pixel values into quantized transformedcoefficients that can be further coded, such as by entropy coding inentropy coding module 216, filtered by de-blocking filter module 222.While processed video signal 112 is shown as being output fromde-blocking filter module 222, in an embodiment of the presentinvention, further formatting and/or buffering can optionally beperformed by signal interface 198 and the processed video signal 112 canlikewise be represented as being output therefrom.

As discussed above, many of the modules of motion compensation module150 operate based on motion vectors determined for neighboringmacroblocks. Neighbor management module 218 generates and storesneighbor data for at least one macroblock of the plurality ofmacroblocks for retrieval by at least one of the motion search module204, the motion refinement module 206, the direct mode module 208,intra-prediction module 210, entropy coding module 216 and deblockingfilter module 222, when operating on at least one neighboring macroblockof the plurality of macroblocks. As the motion vector (or the pluralityof motion vectors in the case of macroblock partitioning, discussedfurther in conjunction with FIGS. 9 and 10) and the other encoding dataare finalized, neighboring data is stored for use in the processing ofneighboring macroblocks that have yet to be processed, yet that willrequire the use of such data. In addition, neighboring data is alsostored for the processing of future pictures, such as future framesand/or fields of video input signal 110.

In an embodiment of the present invention, a data structure, such as alinked list, array or one or more registers are used to associate andstore neighbor data for each macroblock. Neighbor data includes motionvectors, reference indices, quantization parameters, coded-blockpatterns, macroblock types, intra/inter prediction module typesneighboring pixel values and or other data from neighboring macroblocksand/or subblocks used to by one or more of the modules or procedures ofthe present invention to calculate results for a current macroblock. Forexample, in order to determine the predicated motion vector for themotion search module 204 and motion refinement module 206, both themotion vectors and reference index of neighbors are required. Inaddition to these data, the direct mode module 208 requires the motionvectors of the co-located macroblock of previous reference pictures. Thedeblocking filter module 222 operates according to a set of filteringstrengths determined by using the neighbors' motion vectors,quantization parameters, reference index, and coded-block-patterns, etc.For entropy coding in entropy coding module 216, the motion vectordifferences (MVD), macroblock types, quantization parameter delta, interpredication type, etc. are required.

Consider the example where a particular macroblock MB(x,y) requiresneighbor data from macroblocks MB(x−1, y−1), MB(x, y−1), MB (x+1,y−1)and MB(x−1,y). In prior art codecs, the preparation of the neighbor dataneeds to calculate the location of the relevant neighbor sub-blocks.However, the calculation is not as straightforward as it was inconventional video coding standards. For example, in H.264 coding, thesupport of multiple partition types make the size and shape for thesubblocks vary significantly. Furthermore, the support of the macroblockadaptive frame and field (MBAFF) coding allows the macroblocks to beeither in frame or in field mode. For each mode, one neighbor derivationmethod is defined in H.264. So the calculation needs to consider eachmode accordingly. In addition, in order to get all of the neighbor datarequired, the derivation needs to be invoked four times since there arefour neighbors involved—MB(x−1, y−1), MB(x, y−1), MB(x+1, y−1), andMB(x−1, y). So the encoding of the current macroblock MB(x, y) cannotstart not until the location of the four neighbors has been determinedand their data have been fetched from memory.

In an embodiment of the present invention, when each macroblock isprocessed and final motion vectors and encoded data are determined,neighbor data is stored in data structures for each neighboringmacroblock that will need this data. Since the neighbor data is preparedin advance, the current macroblock MB(x,y) can start right away when itis ready to be processed. The burden of pinpointing neighbors isvirtually re-allocated to its preceding macroblocks. The encoding ofmacroblocks can be therefore be more streamline and faster. In otherwords, when the final motion vectors are determined for MB(x−1,y−1),neighbor data is stored for each neighboring macroblock that is yet tobe processed, including MB(x,y) and also other neighboring macroblockssuch as MB(x, y−1), MB(x−2,y) MB(x−1,y). Similarly, when the finalmotion vectors are determined for MB(x,y−1), MB (x+1,y−1) and MB(x−1,y)neighbor data is stored for each neighboring macroblock corresponding toeach of these macroblocks that are yet to be processed, includingMB(x,y). In this fashion, when MB(x,y) is ready to be processed, theneighbor data is already stored in a data structure that corresponds tothis macroblock for fast retrieval.

The motion compensation can then proceed using the retrieved data. Inparticular, the motion search module 204 and/or the motion refinementmodule, can generate at least one predicted motion vector (such as astandard PMV or estimated predicted motion vector) for each macroblockof the plurality of macroblocks using retrieved neighbor data. Further,the direct mode module 208 can generate at least one direct mode motionvector for each macroblock of the plurality of macroblocks usingretrieved neighbor data and the intra-prediction module 210 can generatethe best intra prediction mode for each macroblock of the plurality ofmacroblocks using retrieved neighbor data, and the coding module 216 canuse retrieved neighbor data in entropy coding, each as set forth in theH.264 standard, the MPEG-4 standard, VC-1 (SMPTE standard 421M) or byother standard or other means.

While not expressly shown, video encoder/decoder 102 can include amemory cache, shared memory, a memory management module, a comb filteror other video filter, and/or other module to support the encoding ofvideo input signal 110 into processed video signal 112.

Further details of specific encoding and decoding processes that reusethese function specific modules will be described in greater detail inconjunction with FIGS. 7 and 8.

FIG. 6 presents a graphical representation of macroblock pixels andinterpolated pixels in accordance with an embodiment of the presentinvention. Motion refinement module 206 can optionally operate in aplurality of selected modes including a first mode corresponding to afirst sub-pixel resolution, a second mode corresponding to a secondsub-pixel resolution a third mode corresponding to a full-pixelresolution or other greater or lesser resolution. The resolution can becontrolled based on the desired speed and/or accuracy of the motioncompensation, based on other settings such as the number of selectedpartitions, skip mode parameters and other motion search results, andother variables of motion compensation module 150 that have beendescribed or in conjunction with the motion refinement engine 175 ofFIG. 11 that follows. In addition, the particular resolution can bechosen based on the particular compression standard that is used, suchas an H.264 standard, Motion Picture Experts Group (MPEG) standard,Society of Motion Picture and Television Engineers (SMPTE) standard,etc. For instance, when MPEG2 is implemented one-half pixel resolutioncan be employed. When VC1 is implemented, one-half or one-quarter pixelresolution can be employed. Further, when H.264 is implemented one-halfor one-quarter pixel resolution can be employed. These resolutions canbe preset and employed based on the particular compression standard inuse. Alternatively, these preset resolutions can be modified based onparameters, such as the particular parameters described above.

FIG. 6 represents a portion of a frame or field of a video image wherepixels in row N include a, e, and i, and pixels in row N+1 arerepresented by 1′, 5′ and 9′. In operation, one-half pixel resolutionmotion refinement is accomplished by interpolation filter 207 thatinterpolates the full pixel values to produce one-half pixel resolutionvalues c, g, s, u, w, y, 0, 3′, 7′, j′, l′, n′, p′ and r′. In a modecorresponding to one-half pixel resolution, only these pixel andsub-pixel values are used. In a mode corresponding to one-quarter pixelresolution, the other sub-pixel values that are shown can be calculatedby interpolation filter 207 that interpolates the full pixel values.While one-quarter pixel resolution is shown, other values with greateror less resolution can likewise be implemented within the broad scope ofthe present invention. Interpolation filter 207 can operate via abicubic interpolation a bilinear interpolation or other spatialinterpolation technique.

FIG. 7 presents a block flow diagram of a video encoding operation inaccordance with an embodiment of the present invention. In particular,an example video encoding operation is shown that uses many of thefunction specific modules described in conjunction with FIG. 5 toimplement a similar encoding operation. Motion search module 204generates a motion search motion vector for each macroblock of aplurality of macroblocks based on a current frame/field 260 and one ormore reference frames/fields 262. Motion refinement module 206 generatesa refined motion vector for each macroblock of the plurality ofmacroblocks, based on the motion search motion vector. As discussedabove, motion refinement module 206 can use interpolation filter 207 togenerate sub-pixel resolution. Intra-prediction module 210 evaluates andchooses a best intra prediction mode for each macroblock of theplurality of macroblocks. Mode decision module 212 determines a finalmotion vector for each macroblock of the plurality of macroblocks basedon costs associated with the refined motion vector, and the best intraprediction mode.

Reconstruction module 214 generates residual pixel values correspondingto the final motion vector for each macroblock of the plurality ofmacroblocks by subtraction from the pixel values of the currentframe/field 260 by difference circuit 282 and generates unfilteredreconstructed frames/fields by re-adding residual pixel values(processed through transform and quantization module 220) using addingcircuit 284. The transform and quantization module 220 transforms andquantizes the residual pixel values in transform module 270 andquantization module 272 and re-forms residual pixel values by inversetransforming and dequantization in inverse transform module 276 anddequantization module 274. In addition, the quantized and transformedresidual pixel values are reordered by reordering module 278 and entropyencoded by entropy encoding module 280 of entropy coding/reorderingmodule 216 to form network abstraction layer output 281.

Deblocking filter module 222 forms the current reconstructedframes/fields 264 from the unfiltered reconstructed frames/fields. Whilea deblocking filter is shown, other filter modules such as comb filtersor other filter configurations can likewise be used within the broadscope of the present invention. It should also be noted that currentreconstructed frames/fields 264 can be buffered to generate referenceframes/fields 262 for future current frames/fields 260.

As discussed in conjunction with FIG. 5, one of more of the modulesdescribed herein can also be used in the decoding process as will bedescribed further in conjunction with FIG. 8.

FIG. 8 presents a block flow diagram of a video decoding operation inaccordance with an embodiment of the present invention. In particular,this video decoding operation contains many common elements described inconjunction with FIG. 7 that are referred to by common referencenumerals. In this case, the motion refinement module 206 includinginterpolation filter 207, the intra-prediction module 210, the modedecision module 212, and the deblocking filter module 222 are each usedas described in conjunction with FIG. 6 to process referenceframes/fields 262. In addition, the reconstruction module 214 reuses theadding circuit 284 and the transform and quantization module reuses theinverse transform module 276 and the inverse quantization module 274. Inshould be noted that while entropy coding/reorder module 216 is reused,instead of reordering module 278 and entropy encoding module 280producing the network abstraction layer output 281, network abstractionlayer input 287 is processed by entropy decoding module 286 andreordering module 288.

While the reuse of modules, such as particular function specifichardware engines, has been described in conjunction with the specificencoding and decoding operations of FIGS. 7 and 8, the present inventioncan likewise be similarly employed to the other embodiments of thepresent invention described in conjunction with FIGS. 1-6 and 9-14and/or with other function specific modules used in conjunction withvideo encoding and decoding.

FIG. 9 presents a graphical representation of the relationship betweenexemplary top frame and bottom frame macroblocks (250, 252) andexemplary top field and bottom field macroblocks (254, 256). Motionsearch module 204 generates a motion search motion vector for eachmacroblock by contemporaneously evaluating a macroblock pair thatincludes a top frame macroblock 250 and bottom frame macroblock 252 froma frame of the video input signal 110 and a top field macroblock 254 anda bottom field macroblock 256 from corresponding fields of the videoinput signal 110.

Considering the example shown, each of the macroblocks are 16 pixels by16 pixels in size. Motion search is performed in full pixel resolution,or other resolution, either coarser or finer, by comparing a candidateframe macroblock pair of a current frame that includes top framemacroblock 250 and bottom frame macroblock 252 to the macroblock pair ofa reference frame. In addition, lines of a first parity (such as oddlines) from the candidate frame macroblock pair are grouped to form topfield macroblock 254. Similarly, lines of a second parity (such as evenlines) from the candidate frame macroblock pair are grouped to formbottom field macroblock 256. Motion search module 204 calculates a costassociated a plurality of lines by:

(a) generating a cost associated with the top frame macroblock 250 basedon a cost accumulated for a plurality of top lines of the plurality oflines,

(b) generating a cost associated with the bottom frame macroblock 252based on a cost accumulated for a plurality of bottom lines of theplurality of lines,

(c) generating a cost associated with the top field macroblock 254 basedon a cost accumulated for a plurality of first-parity lines of theplurality of lines compared with either a top or bottom field reference,and

(d) generating a cost associated with the bottom field macroblock 256based on a cost accumulated for a plurality of second-parity lines ofthe plurality of lines, also based on either a top or bottom fieldreference. In this fashion, six costs can be generated contemporaneouslyfor the macroblock pair: top frame compared with top frame of thereference; bottom frame compared with the bottom frame of the reference;top field compared with top field of the reference; bottom fieldcompared with the bottom field of the reference; top field compared withbottom field of the reference; and bottom field compared with the topfield of the reference.

Each of these costs can be generated based on the sum of the absolutedifferences (SAD) of the pixel values of the current frame or field withthe reference frame or field. The SADs can be calculatedcontemporaneously, in a single pass, based on the accumulation for eachline. The overall SAD for a particular macroblock (top or bottom, frameor field) can be determined by totaling the SADs for the lines that makeup that particular macroblock. Alternatively, the SADs can be calculatedin a single pass, based on the smaller segments such as 4×1 segmentsthat can be accumulated into subblocks, that in turn can be accumulatedinto overall macroblock totals. This alternative arrangementparticularly lends itself to motion search modules that operate based onthe partitioning of macroblocks into smaller subblocks, as will bediscussed further in conjunction with FIG. 7.

The motion search module 204 is particularly well adapted to operationin conjunction with macroblock adaptive frame and field processing.Frame mode costs for the current macroblock pair can be generated asdiscussed above. In addition, motion search module 204 optionallygenerates a field decision based on accumulated differences, such asSAD, between the current bottom field macroblock and a bottom fieldmacroblock reference, the current bottom field macroblock and a topfield macroblock reference, the current top field macroblock and thebottom field macroblock reference, and the current top field macroblockand the top field macroblock reference. The field decision includesdetermining which combination (top/top, bottom/bottom) or (top/bottom,bottom/top) yields a lower cost. Similarly, motion search module 204 canoptionally choose either frame mode or field mode for a particularmacroblock pair, based on whether the frame mode cost compares morefavorably (e.g. are lower) or less favorably (e.g. higher) to the fieldmode cost, based on the field mode decision. In addition, other modulesof motion compensation module 150 that operate on both frames and fieldcan operate can similarly operate.

In particular, the neighbor management module 218 generates neighbordata that includes frame below neighbor data for retrieval by aneighboring macroblock in a row below the at least one macroblock whenprocessing in frame mode and field below neighbor data for retrieval bythe neighboring macroblock in a row below the at least one macroblockwhen processing in field mode. In addition, the neighbor data includesframe right neighbor data for retrieval by a neighboring macroblock tothe right of the at least one macroblock when processing in field modeand field right neighbor data for retrieval by the neighboringmacroblock to the right of the at least one macroblock when processingin field mode. In this fashion, the motion search module and othermodules of motion compensation module 150 that operate using neighbordata and that can operate in either a frame or field mode can directlyaccess either the frame mode neighbor data for frame mode neighborsabove the macroblock of interest, the field mode neighbor data for fieldmode neighbors above the macroblock of interest, the frame mode neighbordata for the frame mode neighbor to the left of the macroblock ofinterest and/or the field mode neighbor data for the field mode neighborto the left of the macroblock of interest. As before, this informationis stored in the processing of the prior macroblocks, whether themacroblocks themselves were processed in frame or in field mode, and canbe accessed in the processing of the macroblock of interest by retrievaldirectly from memory and without a look-up table or further processing.

FIG. 10 presents a graphical representation of exemplary partitioningsof a macroblock of a video input signal into subblocks. While themodules described in conjunction with FIG. 5 above can operate onmacroblocks having a size such as 16 pixels×16 pixels, such as inaccordance with the H.264 standard, macroblocks can be partitioned intosubblocks of smaller size, as small as 4 pixels on a side. The subblockscan be dealt with in the same way as macroblocks. For example, motionsearch module 204 can generate separate motion search motion vectors foreach subblock of each macroblock, etc.

Macroblock 300, 302, 304 and 306 represent examples of partitioning intosubblocks in accordance with the H.264 standard. Macroblock 300 is a16×16 macroblock that is partitioned into two 8×16 subblocks. Macroblock302 is a 16×16 macroblock that is partitioned into three 8×8 subblocksand four 4×4 subblocks. Macroblock 304 is a 16×16 macroblock that ispartitioned into four 8×8 subblocks. Macroblock 306 is a 16×16macroblock that is partitioned into an 8×8 subblock, two 4×8 subblocks,two 8×4 subblocks, and four 4×4 subblocks. The partitioning of themacroblocks into smaller subblocks increases the complexity of themotion compensation by requiring various compensation methods, such asthe motion search to determine, not only the motion search motionvectors for each subblock, but the best motion vectors over the set ofpartitions of a particular macroblock. The result however can yield moreaccurate motion compensation and reduced compression artifacts in thedecoded video image.

FIG. 11 presents a block diagram representation of a videoencoder/decoder 102 that includes motion refinement engine 175 inaccordance with an embodiment of the present invention. In addition tomodules referred to by common reference numerals used to refer tocorresponding modules of previously described embodiments, motionrefinement engine 175 includes a shared memory 205 that can beimplemented separately from, or part of, memory module 202. In addition,motion refinement engine 175 can be implemented in a special purposehardware configuration that has a generic design capable of handlingsub-pixel search using different reference pictures—either frame orfield and either forward in time, backward in time or a blend betweenforward and backward. Motion refinement engine 175 can operate in aplurality of compression modes to support a plurality of differentcompression algorithms such as H.264, MPEG-4, VC-1, etc. in an optimizedand single framework. Reconstruction can be performed for chroma only,luma only or both chroma and luma.

For example, the capabilities of these compression modes can include:

H.264:

-   1. Motion search and refinement on all large partitions into    subblocks of size (16×16), (16×8), (8×16) and (8×8) for    forward/backward and blended directions when MBAFF is ON. This also    includes field and frame MB types.-   2. Motion search and refinement on all partitions into subblocks of    size (16×16), (16×8), (8×16) and (8×8), and subpartitions into    subblocks of size (8×8), (8×4), (4×8), and (4×4) for    forward/backward and blended directions when MBAFF is OFF.-   3. Computation of direct mode and/or skip mode cost for MBAFF ON and    OFF.-   4. Mode decision is based on all the above partitions for MBAFF ON    and OFF. The chroma reconstruction for the corresponding partitions    is implicitly performed when the luma motion reconstruction is    invoked.-   5. Motion refinement and compensation include quarter pixel accurate    final motion vectors using the 6 tap filter algorithms of the H.264    standard.

VC-1:

-   1. Motion search and refinement for both 16×16 and 8×8 partitions    for both field and frame cases for forward, backward and blended    directions.-   2. Mode decision is based on each of the partitions above. This    involves the luma and corresponding chroma reconstruction.-   3. Motion refinement and compensation include bilinear half pixel    accurate final motion vectors of the VC-1 standard.

MPEG-4:

-   1. Motion search and refinement for both 16×16 and 8×8 partitions    for both field and frame cases for forward, backward and blended    directions.-   2. Mode decision is based on all of the partitions above.    Reconstruction involves the luma only.-   3. Motion refinement and compensation include bilinear half pixel    accurate MVs of the VC-1 standard.

Further, motion refinement engine 175 can operate in two basic modes ofoperation (1) where the operations of motion refinement module 206 aretriggered by and/or directed by software/firmware algorithms included inmemory module 202 and executed by processing module 200; and (2) whereoperations of motion refinement module 206 are triggered by the motionsearch module 204, with little or no software/firmware intervention. Thefirst mode operates in accordance with one or more standards, possiblymodified as described herein. The second mode of operation can bedynamically controlled and executed more quickly, in an automatedfashion and without a loss of quality.

Shared memory 205 can be individually, independently andcontemporaneously accessed by motion search module 204 and motionrefinement module 206 to facilitate either the first or second mode ofoperation. In particular, shared memory 205 includes a portion ofmemory, such as a cost table that stores results (such as motion vectorsand costs) that result from the computations performed by motion searchmodule 204. This cost table can include a plurality of fixed locationsin shared memory where these computations are stored for later retrievalby motion refinement module 206, particularly for use in the second modeof operation. In addition, to the cost table, the shared memory 205 canalso store additional information, such as a hint table, that tells themotion refinement module 206 and the firmware of the decisions it makesfor use in either mode, again based on the computations performed bymotion search module 204. Examples include: identifying which partitionsare good, others that are not as good and/or can be discarded;identifying either frame mode or field mode as being better and by howmuch; and identifying which direction, amongst forward, backward andblended is good and by how much, etc.

The motion search module may terminate its computations early based onthe results it obtains. In any case, motion search can trigger thebeginning of motion refinement directly by a trigger signal sent fromthe motion search module 204 to the motion refinement module 206. Motionrefinement module 206 can, based on the data stored in the hint tableand/or the cost table, have the option to refine only particularpartitions, a particular mode (frame or field), and/or a particulardirection (forward, backward or blended) that either the motion searchmodule 204 or the motion refinement module 206 determines to be goodbased on a cost threshold or other performance criteria. In thealternative, the motion refinement module can proceed directly based onsoftware/firmware algorithms in a more uniform approach. In thisfashion, motion refinement engine 175 can dynamically and selectivelyoperate so as to complete the motion search and motion refinement,pipelined and in parallel, such that the refinement is performed forselected partitions, all the subblocks for a single partition, group ofpartitions or an entire MB/MB pair on both a frame and field basis, ononly frame or field mode basis, and for forward, backward and blendeddirections of for only a particular direction, based on the computationsperformed by the motion search module 204.

In operation, motion search module 204 contemporaneously generates amotion search motion vector for a plurality of subblocks for a pluralityof partitionings of a macroblock of a plurality of MB/MB pairs. Motionrefinement module 206, when enabled, contemporaneously generates arefined motion vector for the plurality of subblocks for the pluralityof partitionings of the MB/MB pairs of the plurality of macroblocks,based on the motion search motion vector for each of the plurality ofsubblocks of the macroblock of the plurality of macroblocks. Modedecision module selects a selected partitioning of the plurality ofpartitionings, based on costs associated with the refined motion vectorfor each of the plurality of subblocks of the plurality ofpartitionings, of the macroblock of the plurality of macroblocks, anddetermines a final motion vector for each of the plurality of subblockscorresponding to the selected partitioning of the macroblock of theplurality of macroblocks. Reconstruction module 214 generates residualpixel values, for chroma and/or luma, corresponding to a final motionvector for the plurality of subblocks of the macroblock of the pluralityof macroblocks.

Further, the motion search module 204 and the motion refinement module206 can operate in a plurality of other selected modes including modescorresponding to different compression standards, and wherein theplurality of partitionings can be based on the selected mode. Forinstance, in one mode, the motion search module 204 and the motionrefinement module 206 are capable of operating with macroblock adaptiveframe and field (MBAFF) enabled when a MBAFF signal is asserted and withMBAFF disabled when the MBAFF enable signal is deasserted, and whereinthe plurality of partitionings are based on the MBAFF enable signal. Inan embodiment, when the MBAFF signal is asserted, the plurality ofpartitionings of the macroblock partition the macroblock into subblockshaving a first minimum dimension of sizes 16 pixels by 16 pixels, 16pixels by 8 pixels, 8 pixels by 16 pixels, and 8 pixels by 8pixels—having a minimum dimension of 8 pixels. Further, when the MBAFFsignal is deasserted, the plurality of partitionings of the macroblockpartition the macroblock into subblocks having a second minimumdimension of sizes 16 pixels by 16 pixels, 16 pixels by 8 pixels, 8pixels by 16 pixels, 8 pixels by 8 pixels, 4 pixels by 8 pixels, 8pixels by 4 pixels, and 4 pixels by 4 pixels—having a minimum dimensionof 4 pixels. In other modes of operation, the plurality of partitioningsof the macroblock partition the macroblock into subblocks of sizes 16pixels by 16 pixels, and 8 pixels by 8 pixels. While particularmacroblock dimensions are described above, other dimensions are likewisepossible with the scope of the present invention.

In addition to the partitionings of the MB/MB pairs being based on theparticular compression standard employed, motion search module 204 cangenerate a motion search motion vector for a plurality of subblocks fora plurality of partitionings of a macroblock of a plurality ofmacroblocks and generate a selected group of the plurality ofpartitionings based on a group selection signal. Further, motionrefinement module 206 can generate the refined motion vector for theplurality of subblocks for the selected group of the plurality ofpartitionings of the macroblock of the plurality of macroblocks, basedon the motion search motion vector for each of the plurality ofsubblocks of the macroblock of the plurality of macroblocks. In thisembodiment, the group selection signal can be used by the motion searchmodule 204 to selectively apply one or more thresholds to narrow downthe number of partitions considered by motion refinement module 206 inorder to speed up the algorithm.

For example, when the group selection signal has a first value, themotion search module 204 determines the selected group of the pluralityof partitionings by comparing, for the plurality of partitionings of themacroblock of the plurality of macroblocks, the accumulated costsassociated with the motion search motion vector for each of theplurality of subblocks with a first threshold, and assigning theselected group to be a partitioning with the accumulated cost thatcompares favorably to the first threshold. In this mode, if a particularpartitioning is found that generates a very good cost, the motion searchmodule 204 can terminate early for the particular macroblock and motionrefinement module 206 can operate, not on the entire set ofpartitionings, but on the particular partitioning that generates a costthat compares favorably to the first threshold.

Further, when the group selection signal has a second value, the motionsearch module 204 determines the selected group of the plurality ofpartitionings by comparing, for the plurality of partitionings of themacroblock of the plurality of macroblocks, the accumulated the costsassociated with the motion search motion vector for each of theplurality of subblocks and assigning the selected group to be theselected partitioning with the most favorable accumulated cost. Again,motion refinement module 206 can operate, not on the entire set ofpartitionings, but on the particular partitioning that generates themost favorable cost from the motion search.

In addition, when the group selection signal has a third value, themotion search module 204 determines the selected group of the pluralityof partitionings by comparing, for the plurality of partitionings of themacroblock of the plurality of macroblocks, the accumulated the costsassociated with the motion search motion vector for each of theplurality of subblocks with a second threshold, and assigning theselected group to be each of partitionings of the plurality ofpartitionings with accumulated cost that compares favorably to thesecond threshold. In this mode, motion refinement module 206 canoperate, not on the entire set of partitionings, but only on thosepartitionings that generate a cost that compares favorably to the secondthreshold.

As discussed above, the motion search module 204 and motion refinementmodule 206 can be pipelined and operate to contemporaneously generatethe motion search motion vector for the plurality of subblocks for aplurality of partitionings of a macroblock of a plurality ofmacroblocks, in parallel. In addition, shared memory 205 can be closelycoupled to both motion search module 204 and motion refinement module206 to efficiently store the results for selected group of partitioningsfrom the motion search module 204 for use by the motion refinementmodule 206. In particular, motion search module 204 stores the selectedgroup of partitionings and the corresponding motion search motionvectors in the shared memory and other results in the cost and hinttables. Motion refinement module 206 retrieves the selected group ofpartitionings and the corresponding motion search motion vectors fromthe shared memory. In a particular embodiment, the motion search module204 can generate a trigger signal in response to the storage of theselected group of partitionings of the macroblock and the correspondingmotion search motion vectors and/or other results in the shared memory,and the motion refinement module 206 can commence the retrieval of theselected group of partitionings and the corresponding motion searchmotion vectors and/or other results from the shared memory in responseto the trigger signal.

As discussed above, the motion refinement for a particular macroblockcan be turned off by selectively disabling the motion refinement modulefor a particular application, compression standard, or a macroblock, Forinstance, a skip mode can be determines when the cost associated withthe stationary motion vector compares favorably to a skip mode costthreshold or if the total cost associated with a particular partitioningcompares favorably to a skip refinement cost threshold. In this skipmode, the motion search motion vector can be used in place of therefined motion vector. In yet another optional feature, the motionsearch module 204 generates a motion search motion vector for aplurality of subblocks for a plurality of partitionings of a macroblockof a plurality of macroblocks based one or several costs calculationssuch as on a sum of accumulated differences (SAD) cost, as previouslydiscussed. However, motion refinement module 206, when enabled,generates a refined motion vector for the plurality of subblocks for theplurality of partitionings of the macroblock of the plurality ofmacroblocks, based on the motion search motion vector for each of theplurality of subblocks of the macroblock of the plurality of macroblocksbased on a sum of accumulated transform differences (SATD) cost. In thiscase, the mode decision module 212 must operate on either SAD costs fromthe motion search module 204 or SATD costs from the motion refinementmodule 206.

Mode decision module 212 is coupled to the motion refinement module 206and the motion search module 204. When the motion refinement module 206is enabled for a macroblock, the mode decision module 212 selects aselected partitioning of the plurality of partitionings, based on SATDcosts associated with the refined motion vector for each subblocks ofthe plurality of partitionings of the macroblock. In addition, when themotion refinement module 206 is disabled for the macroblock of theplurality of macroblocks, mode decision module 212 selects a selectedpartitioning of the plurality of partitionings, based on SAD costsassociated with the motion search motion vector for each subblocks ofthe plurality of partitionings of the macroblock, and that determines afinal motion vector for each subblocks corresponding to the selectedpartitioning of the macroblock.

Since the motion refinement engine 175 can operate in both a frame orfield mode, mode decision module 212 selects one of a frame mode and afield mode for the macroblock, based on SATD costs associated with therefined motion vector for each subblocks of the plurality ofpartitionings of the macroblock, or based on SAD costs associated withthe motion search motion vector for each subblocks of the plurality ofpartitionings of the macroblock.

In an embodiment of the present invention, the motion refinement engine175 is designed to work through a command FIFO located in the sharedmemory 205. The functional flexibilities of the engine are made possiblewith a highly flexible design of the command FIFO. The command FIFO hasfour 32-bit registers, of which one of them is the trigger for themotion refinement engine 175. It could be programmed so as to completethe motion refinement/compensation for a single partition, group ofpartitions or an entire MB/MB pair, with or without MBAFF, for forward,backward and blended directions with equal ease. It should be noted thatseveral bits are reserved to support future features of the presentinvention.

In a particular embodiment, the structure of the command FIFO is assummarized in the table below.

Bit Field Name Position Description TASK 1:0 0 = Search/refine 1 =Direct 2 = Motion Compensation/Reconstruction 3 = Decode DIRECTION 4:2Bit 0: FWD Bit 1: BWD Bit 2: Blended WRITE_COST  5 0 = Don't write outCost 1 = Write out Cost PARTITIONS 51:6  Which partitions to turn on andoff. This is interpreted in accordance with a MBAFF Flag TAG 58:52 Totag the Index FIFO entry- 7 bits DONE 59 Generate Interrupt whenfinished this entry PRED_DIFF_INDEX 63:60 Which Predicted and DifferenceIndex to write to CURR_Y_MB_INDEX 67:64 Which Current Y MB Index to readfrom CURR_C_MB_INDEX 71:68 Which Current C MB Index to read fromFWD_INDEX 75:72 FWD Command Table Index to parse through BWD_INDEX 79:76BWD Command Table Index to parse through BLEND_INDEX 83:80 BLEND CommandTable Index to write to Reserved 84 THRESHOLD_ENABLE 85 PerformRefinement only for the partitions indicated by the threshold table.BEST_MB_PARTITION 86 Use only the Best Macroblock partition. This willignore the PARTITIONS field in this index FIFO entry Reserved 87DIRECT_TOP_FRM_FLD_SEL 89:88 00: None, 01: Frame, 10: Field, 11: BothDIRECT_BOT_FRM_FLD_SEL 91:90 00: None, 01: Frame, 10: Field, 11: BothWRITE_PRED_PIXELS 93:92 0 = Don't write out Predicted Pixels 1 = Writeout Top MB Predicted Pixels 2 = Write out Bottom MB Predicted Pixels 3 =Write out both Top and Bottom MB Predicted Pixels (turned on for thelast entry of motion compensation) WRITE_DIFF_PIXELS 95:94 0 = Don'tWrite out Difference Pixels 1 = Write out Top MB Difference Pixels 2 =Write out Bottom MB Difference Pixels 3 = Write out both Top and BottomMB Predicted Pixels (Note: In Motion Compensation Mode, this will writeout the Motion Compensation Pixels and will be turned on for the lastentry of motion compensation) CURR_MB_X 102:96  Current X coordinate ofMacroblock Reserved 103 CURR_MB_Y 110:104 Current Y coordinate ofMacroblock Reserved 111 LAMBDA 118:112 Portion of weighted for costReserved 121:119 BWD_REF_INDEX 124:122 Backward Reference IndexFWD_REF_INDEX 127:125 Forward Reference IndexIn addition to the Command FIFO, there are also some slice levelregisters in the shared memory that the motion refinement engine 175uses. These include common video information like codec used, picturewidth, picture height, slice type, MBAFF Flag, SATD/SAD flag and thelike. By appropriately programming the above bits, the followingflexibilities/scenarios could be addressed:

-   -   1. The task bits define the operation to be performed by the        motion refinement engine 175. By appropriately combining this        with the codec information in the registers, the motion        refinement engine 175 can perform any of the above tasks for all        the codecs as listed earlier.    -   2. The direction bits refer to the reference picture that needs        to be used and are particularly useful in coding B Slices. Any        combination of these 3 bits could be set for any of the tasks.        By enabling all these 3 bits for refinement, the motion        refinement engine 175 can complete motion refinement for the        entire MB in all three directions in one call. However, the        motion refinement engine 175 can also could select any        particular direction and perform refinement only for that (as        might be required in P slices). The command FIFO, thus offers        the flexibility to address both cases of a single,        all-directions call or multiple one-direction calls.    -   3. The partitions bits are very flexible in their design as they        holistically cater to motion refinement and reconstruction for        all partitions and sub partitions. By effectively combining        these bits with the direction bits, the motion refinement engine        175 can achieve both the extremes i.e. perform refinement for        all partitions for all the directions in one shot or perform        refinement/compensation for a select set of partitions in a        particular direction. The partition bits are also dynamically        interpreted differently by the motion refinement engine 175        engine based on the MBAFF ON flag in the registers. Thus, using        an optimized, limited set of bits, the motion refinement engine        175 can address an exhaustive scenario of partition        combinations. The structure of the partition bits for each of        these modes is summarized in the tables that follow for frame        (FRM), field (FLD) and direct mode (DIRECT) results.

MBAFF ON:

Macroblock Partition Frm/Fld Bit TOP MB 16 × 16 FRM 0 FLD 1 DIRECT 2 16× 8 Top Partition FRM 3 FLD 4 16 × 8 Bottom Partition FRM 5 FLD 6 8 × 16Left Partition FRM 7 FLD 8 8 × 16 Right Partition FRM 9 FLD 10 8 × 8 TopLeft Partition FRM 11 FLD 12 DIRECT 13 8 × 8 Top Right Partition FRM 14FLD 15 DIRECT 16 8 × 8 Bottom Left Partition FRM 17 FLD 18 DIRECT 19 8 ×8 Bottom Right Partition FRM 20 FLD 21 DIRECT 22 BOT MB 16 × 16 FRM 23FLD 24 DIRECT 25 16 × 8 Top Partition FRM 26 FLD 27 16 × 8 BottomPartition FRM 28 FLD 29 8 × 16 Left Partition FRM 30 FLD 31 8 × 16 RightPartition FRM 32 FLD 33 8 × 8 Top Left Partition FRM 34 FLD 35 DIRECT 368 × 8 Top Right Partition FRM 37 FLD 38 DIRECT 39 8 × 8 Bottom LeftPartition FRM 40 FLD 41 DIRECT 42 8 × 8 Bottom Right Partition FRM 43FLD 44 DIRECT 45

MBAFF OFF:

Partition Bit FRAME 16 × 16 Enable 0 DIRECT 1 16 × 8 Top Partition 2 16× 8 Bottom Partition 3 8 × 16 Left Partition 4 8 × 16 Right Partition 58 × 8 Top Left Partition 8 × 8 6 8 × 4 7 4 × 8 8 4 × 4 9 DIRECT 10 8 × 8Top Right Partition 8 × 8 11 8 × 4 12 4 × 8 13 4 × 4 14 DIRECT 15 8 × 8Bottom Left Partition 8 × 8 16 8 × 4 17 4 × 8 18 4 × 4 19 DIRECT 20 8 ×8 Bottom Right Partition 8 × 8 21 8 × 4 22 4 × 8 23 4 × 4 24 DIRECT 25Reserved 45:26The command FIFO also has early termination strategies, which could beefficiently used to speed up the motion refinement intelligently. Thesecould be used directly in conjunction with the motion search module 204or with the intervention of the processor 200 to suit the algorithmicneeds. These are as follows:

-   -   a. BEST MB PARTITION: This is the super fast mode, which chooses        only the best mode as indicated by the motion search to perform        refinement on. Motion refinement only looks at the particular        partition that are in the in the threshold table that are set        based on the motion search results for the BEST partition only        one frame or field.    -   b. THRESHOLD ENABLE: This flag is used to enable the usage of        the threshold information in a motion search MS Stats Register.        If this bit is ON, the motion refinement engine 175 performs        refinement ONLY for the modes specified in the threshold portion        of the MS Stats Register. This bit works as follows. For each of        the Top/Bottom, Frame/Field MBs, do the following:        -   If any of the partition bits (any of 16×16, 16×8, 8×16, 8×8)            are enabled in the threshold portion of the MS Stats            Register (this means that thresholds have been met for those            partitions), do all those enabled partitions irrespective of            the PARTITION bits in the Command FIFO. For the MBAFF OFF            case, when the 8×8 bit is set, refinement is done ONLY for            the best sub partition as specified in a hint table for each            of the 8×8 partitions. Motion refinement only looks at            particular partitions that are in the threshold table that            are set based on the motion search results for those            partitions that meet the threshold.

FIG. 12 presents a block diagram representation of a video distributionsystem 375 in accordance with an embodiment of the present invention. Inparticular, processed video signal 112 is transmitted from a first videoencoder/decoder 102 via a transmission path 122 to a second videoencoder/decoder 102 that operates as a decoder. The second videoencoder/decoder 102 operates to decode the processed video signal 112for display on a display device such as television 10, computer 20 orother display device.

The transmission path 122 can include a wireless path that operates inaccordance with a wireless local area network protocol such as an 802.11protocol, a WIMAX protocol, a Bluetooth protocol, etc. Further, thetransmission path can include a wired path that operates in accordancewith a wired protocol such as a Universal Serial Bus protocol, anEthernet protocol or other high speed protocol.

FIG. 13 presents a block diagram representation of a video storagesystem 179 in accordance with an embodiment of the present invention. Inparticular, device 11 is a set top box with built-in digital videorecorder functionality, a stand alone digital video recorder, a DVDrecorder/player or other device that stores the processed video signal112 for display on video display device such as television 12. Whilevideo encoder/decoder 102 is shown as a separate device, it can furtherbe incorporated into device 11. In this configuration, videoencoder/decoder 102 can further operate to decode the processed videosignal 112 when retrieved from storage to generate a video signal in aformat that is suitable for display by video display device 12. Whilethese particular devices are illustrated, video storage system 179 caninclude a hard drive, flash memory device, computer, DVD burner, or anyother device that is capable of generating, storing, decoding and/ordisplaying the video content of processed video signal 112 in accordancewith the methods and systems described in conjunction with the featuresand functions of the present invention as described herein.

FIG. 14 presents a flowchart representation of a method in accordancewith an embodiment of the present invention. In particular, a method ispresented for use in conjunction with one or more of the features andfunctions described in association with FIGS. 1-13. In step 400, a videoprocessing device is operated in an encoding mode when a mode selectionsignal has a first value and in step 402, the video processing device isoperated in a decoding mode when the mode selection signal has a secondvalue. More specifically step 400 utilizes a interpolation filter toperform an encoding function and step 402 utilizes the sameinterpolation filter to perform a decoding function.

In an embodiment of the present invention, the interpolation filteroperates in accordance with at least one of, a bicubic interpolation,and a bilinear interpolation. The plurality of interpolated pixels canbe interpolated to sub-pixel resolution.

In an embodiment of the present invention, the encoding mode and thedecoding mode each operate in one of an H.264 standard, a Motion PictureExperts Group (MPEG) standard, and a Society of Motion Picture andTelevision Engineers (SMPTE) standard. Further the encoding mode and thedecoding mode can selectively operate in accordance with a firststandard when a standard selection signal has a first value and inaccordance with a second standard when the standard selection signal hasa second value.

FIG. 15 presents a flowchart representation of a method in accordancewith an embodiment of the present invention. In particular, a method ispresented for use in conjunction with one or more of the features andfunctions described in association with FIGS. 1-14. In step 500, a videoprocessing device is operated in an encoding mode when a mode selectionsignal has a first value and in step 502, the video processing device isoperated in a decoding mode when the mode selection signal has a secondvalue. More specifically step 500 utilizes an intra-prediction module toperform an encoding function and step 502 utilizes the sameintra-prediction module to perform a decoding function.

In an embodiment of the present invention, the encoding mode and thedecoding mode each operate in one of an H.264 standard, a Motion PictureExperts Group (MPEG) standard, and a Society of Motion Picture andTelevision Engineers (SMPTE) standard. Further the encoding mode and thedecoding mode can selectively operate in accordance with a firststandard when a standard selection signal has a first value and inaccordance with a second standard when the standard selection signal hasa second value.

In preferred embodiments, the circuit components of motion refinementengine 175 are implemented using 0.35 micron or smaller CMOS technology.Provided however that other circuit technologies, both integrated ornon-integrated, may be used within the broad scope of the presentinvention.

While particular combinations of various functions and features of thepresent invention have been expressly described herein, othercombinations of these features and functions are possible that are notlimited by the particular examples disclosed herein are expresslyincorporated in within the scope of the present invention.

As one of ordinary skill in the art will appreciate, the term“substantially” or “approximately”, as may be used herein, provides anindustry-accepted tolerance to its corresponding term and/or relativitybetween items. Such an industry-accepted tolerance ranges from less thanone percent to twenty percent and corresponds to, but is not limited to,component values, integrated circuit process variations, temperaturevariations, rise and fall times, and/or thermal noise. Such relativitybetween items ranges from a difference of a few percent to magnitudedifferences. As one of ordinary skill in the art will furtherappreciate, the term “coupled”, as may be used herein, includes directcoupling and indirect coupling via another component, element, circuit,or module where, for indirect coupling, the intervening component,element, circuit, or module does not modify the information of a signalbut may adjust its current level, voltage level, and/or power level. Asone of ordinary skill in the art will also appreciate, inferred coupling(i.e., where one element is coupled to another element by inference)includes direct and indirect coupling between two elements in the samemanner as “coupled”. As one of ordinary skill in the art will furtherappreciate, the term “compares favorably”, as may be used herein,indicates that a comparison between two or more elements, items,signals, etc., provides a desired relationship. For example, when thedesired relationship is that signal 1 has a greater magnitude thansignal 2, a favorable comparison may be achieved when the magnitude ofsignal 1 is greater than that of signal 2 or when the magnitude ofsignal 2 is less than that of signal 1.

As the term module is used in the description of the various embodimentsof the present invention, a module includes a functional block that isimplemented in hardware, software, and/or firmware that performs one ormodule functions such as the processing of an input signal to produce anoutput signal. As used herein, a module may contain submodules thatthemselves are modules.

Thus, there has been described herein an apparatus and method, as wellas several embodiments including a preferred embodiment, forimplementing a video processing device and a video encoder/decoder foruse therewith. Various embodiments of the present inventionherein-described have features that distinguish the present inventionfrom the prior art.

It will be apparent to those skilled in the art that the disclosedinvention may be modified in numerous ways and may assume manyembodiments other than the preferred forms specifically set out anddescribed above. Accordingly, it is intended by the appended claims tocover all modifications of the invention which fall within the truespirit and scope of the invention.

1. A video processing device having an encoding mode where theprocessing device encodes an input signal and a decoding mode where thevideo processing device decodes the input signal, the video processingdevice comprising: a motion search module, that generates a motionsearch motion vector for each macroblock of a plurality of macroblocks;a motion refinement module, coupled to the motion search module, thatgenerates a refined motion vector for each macroblock of the pluralityof macroblocks, based on the motion search motion vector, the motionrefinement module including an interpolation filter that interpolates aplurality pixels for each macroblock of the plurality of macroblocks toform a plurality of interpolated pixels; an intra-prediction module thatgenerates a best intra prediction mode for each macroblock of theplurality of macroblocks; and a mode decision module, coupled to themotion refinement module, the direct mode module and theintra-prediction module, that determines a final motion vector for eachmacroblock of the plurality of macroblocks based on costs associatedwith the refined motion vector, the direct mode motion vector, and thebest intra prediction mode; wherein the interpolation filter operateswhen the video processing device is in the encoding mode and when thevideo processing device is in the decoding mode.
 2. The video processingdevice of claim 1 wherein the encoding mode and the decoding mode eachoperate in one of, an H.264 standard, a Motion Picture Experts Group(MPEG) standard, and a Society of Motion Picture and TelevisionEngineers (SMPTE) standard.
 3. The video processing device of claim 1wherein the encoding mode and the decoding mode selectively operate inaccordance with a first standard when a standard selection signal has afirst value and in accordance with a second standard when the standardselection signal has a second value.
 4. The video processing device ofclaim 1 wherein the interpolation filter operates in accordance with atleast one of, a bicubic interpolation, and a bilinear interpolation. 5.The video processing device of claim 1 wherein the plurality ofinterpolated pixels are interpolated to sub-pixel resolution.
 6. A videoprocessing system having an encoding mode where the processing deviceencodes an input signal and a decoding mode where the video processingsystem decodes the input signal, the video processing device comprising:a motion search module, that generates a motion search motion vector foreach macroblock of a plurality of macroblocks; a motion refinementmodule, coupled to the motion search module, that generates a refinedmotion vector for each macroblock of the plurality of macroblocks, basedon the motion search motion vector, the motion refinement moduleincluding an interpolation filter that interpolates a plurality pixelsfor each macroblock of the plurality of macroblocks to form a pluralityof interpolated pixels, wherein the interpolation filter operates whenthe video processing device is in the encoding mode and when the videoprocessing device is in the decoding mode; an intra-prediction modulethat generates a best intra prediction mode for each macroblock of theplurality of macroblocks; a mode decision module, coupled to the motionrefinement module, the direct mode module and the prediction module,that determines a final motion vector for each macroblock of theplurality of macroblocks based on costs associated with the refinedmotion vector, the direct mode motion vector, and the best intraprediction mode; a reconstruction module, coupled to the mode decisionmodule, that generates residual pixel values corresponding to the finalmotion vector for each macroblock of the plurality of macroblocks whenin the video processing device is in the encoding mode and thatgenerates unfiltered reconstructed frames when the video processingdevice is in the decoding mode and when in a video processing device isin the encoding mode; and a transform and quantization module, coupledto the reconstruction module, that transforms and quantizes the residualpixel values when the video processing device is in the encoding modeand that forms residual pixel values by inverse transforming anddequantization when in a video processing device is in the decoding modeand when in a video processing device is in the encoding mode.
 7. Thevideo processing device of claim 6 wherein the encoding mode and thedecoding mode each operate in one of, an H.264 standard, a MotionPicture Experts Group (MPEG) standard, and a Society of Motion Pictureand Television Engineers (SMPTE) standard.
 8. The video processingdevice of claim 6 wherein the encoding mode and the decoding modeselectively operate in accordance with a first standard when a standardselection signal has a first value and in accordance with a secondstandard when the standard selection signal has a second value.
 9. Thevideo processing device of claim 6 wherein the interpolation filteroperates in accordance with at least one of, a bicubic interpolation,and a bilinear interpolation.
 10. The video processing device of claim 6wherein the plurality of interpolated pixels are interpolated tosub-pixel resolution.
 11. A method comprising: operating a videoprocessing device in an encoding mode when a mode selection signal has afirst value; operating the video processing device in a decoding modewhen the mode selection signal has a second value; wherein the step ofoperating the video processing device in the encoding mode utilizes ainterpolation filter to perform an encoding function and wherein thestep of operating the video processing device in the decoding modeutilizes the interpolation filter to perform a decoding function. 12.The method of claim 11 wherein the interpolation filter operates inaccordance with at least one of, a bicubic interpolation, and a bilinearinterpolation.
 13. The method of claim 11 wherein the plurality ofinterpolated pixels are interpolated to sub-pixel resolution.
 14. Themethod of claim 11 wherein the encoding mode and the decoding mode eachoperate in one of an H.264 standard, a Motion Picture Experts Group(MPEG) standard, and a Society of Motion Picture and TelevisionEngineers (SMPTE) standard.
 15. The method of claim 11 wherein theencoding mode and the decoding mode selectively operate in accordancewith a first standard when a standard selection signal has a first valueand in accordance with a second standard when the standard selectionsignal has a second value.